Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
نویسندگان
چکیده
For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However, when it comes to non-deterministic tree automata, none of these hierarchies is even close to be understood. Here we make an attempt in paving the way towards a clear understanding of tree automata. We concentrate on the class of linear game automata (LGA), and prove within this new context, that all corresponding hierarchies mentioned above—Mostowski-Rabin, Borel, and Wadge—are decidable. The class LGA is obtained by taking linear tree automata with alternation restricted to the choice of path in the input tree. Despite their simplicity, LGA recognize sets of arbitrary high Borel rank. The actual richness of LGA is revealed by the height of their Wadge hierarchy: (ω) .
منابع مشابه
Tree Automata and Discrete Distributed Games
Distributed games, as defined in [6], is a recent multiplayer extension of discrete two player infinite games. The main motivation for their introduction is that they provide an abstract framework for distributed synthesis problems, in which most known decidable cases can be encoded and solved uniformly. In the present paper, we show that this unifying approach allows as well a better understan...
متن کاملOn the Weak Index Problem for Game Automata
Game automata are known to recognise languages arbitrarily high in both the non-deterministic and alternating Rabin–Mostowski index hierarchies. Recently it was shown that for this class both hierarchies are decidable. Here we complete the picture by showing that the weak index hierarchy is decidable as well. We also provide a procedure computing for a game automaton an equivalent weak alternat...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملTimed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
We introduce timed alternating tree automata as a natural extension of timed automata for the purpose of solving the model checking problem for timed computation tree logic (TCTL) following the automata-theoretic approach. This settles a problem posed by Hen-zinger, Kupferman, and Vardi. With their pioneering work in the late fties and early sixties, BBchi, Rabin, Trakhtenbrot and others demons...
متن کاملFrom $μ$-Calculus to Alternating Tree Automata using Parity Games
μ-Calculus and automata on infinite trees are complementary ways of describing infinite tree languages. The correspondence between μ-Calculus and alternating tree automaton is used to solve the satisfiability and model checking problems by compiling the modal μ-Calculus formula into an alternating tree automata. Thus advocating an automaton model specially tailored for working with modal μ-Calc...
متن کامل